New examples of minimal non-strongly-perfect graphs
نویسندگان
چکیده
A graph is strongly perfect if every induced subgraph H has a stable set that meets nonempty maximal clique of . The characterization graphs by forbidden subgraphs not known. Here we provide several new minimal non-strongly-perfect graphs.
منابع مشابه
Minimal non-neighborhood-perfect graphs
Neighborhood-perfect graphs form a subclass of the perfect graphs if the Strong Perfect Graph Conjecture of C. Berge is true. However, they are still not shown to be perfect. Here we propose the characterization of neighborhood-perfect graphs by studying minimal non-neighborhood-perfect graphs (MNNPG). After presenting some properties of MNNPGs, w e show that the only MNNPGs with neighborhood i...
متن کاملNew Results on Minimal Strongly Imperfect Graphs
The characterization of strongly perfect graphs by a restricted list of forbidden induced subgraphs has remained an open question for a long time. The minimal strongly imperfect graphs which are simultaneous imperfect are only odd holes and odd antiholes ( E. Olaru, [9]), but the entire list is not known, in spite of a lot of particular results in this direction. In this paper we give some new ...
متن کاملTriangle-free strongly circular-perfect graphs
Zhu [15] introduced circular-perfect graphs as a superclass of the well-known perfect graphs and as an important χ-bound class of graphs with the smallest non-trivial χ-binding function χ(G) ≤ ω(G)+1. Perfect graphs have been recently characterized as those graphs without odd holes and odd antiholes as induced subgraphs [4]; in particular, perfect graphs are closed under complementation [7]. In...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولPerfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2021.112334